General gradient projection method of interior points for linear coustrained optimization 一个求解线性不等式约束的非线性规划的广义梯度投影内点算法
Generalized three term - memory gradient projection method for nonlinear programming with nonlinear equality and inequality constraints 求解非线性等式和不等式约束优化问题的三项记忆梯度广义投影算法
Then based on the gradient projection method , the gradient projection direction is deduced . the gradient direction is the base for sensitivity analysis 接着,根据投影梯度法,推导出了投影梯度方向,该梯度方向是灵敏度分析的基础。
In chapter 2 . we give a class of new algorithms for nonlinear programming problems with linear constrained by combining the gradient projection method with non - quasi - newton method which was given in paper [ 2 ] . it ' s global convergence and the superlinear convergence are proved under suitable conditions 在第二章中我们将梯度投影与文[ 2 ]中的非拟牛顿法相结合,给出了求解线性约束非线性优化问题的一类梯度投影非拟牛顿算法。
Used perturbed method and making inexact generalized gradient projection with cone , perturbed generalized gradient projection method is proposed . the field of the algorithm is extended . numerical experiments show that the method is effective . secondly , using the trust region form and the pseudo - directional derivative of minimax problem , we propose the trust region form of minimax problem 对信赖域法作了进一步的研究,借助minimax问题的伪方向导数,构造出其信赖域二次模型,并结合非单调策略,给出求解minimax问题的简单易行的信赖域算法。
In chapter 5 , the authors study the convergence properties of the gradient projection method for the constrained optimization problem . in this chapter , a new step - size rule , which avoids fulfiling the classical line search and includes choosing a constant as the step size as a special case , is presented and analyzed 第五章研究了求解约束最优化问题的梯度投影方法,在步长的选取时采用了一种新的策略,这种策略不需要进行传统的线搜索且包含步长取常数这种特例,在较弱的条件下,证明了梯度投影方法的全局收敛性。